Root systems in number fields

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumeration of Totally Real Number Fields of Bounded Root Discriminant

We enumerate all totally real number fields F with root discriminant δF ≤ 14. There are 1229 such fields, each with degree [F : Q] ≤ 9. In this article, we consider the following problem. Problem 1. Given B ∈ R>0, enumerate the set NF (B) of totally real number fields F with root discriminant δF ≤ B, up to isomorphism. To solve Problem 1, for each n ∈ Z>0 we enumerate the set NF (n,B) = {F ∈ NF...

متن کامل

Additive functions for number systems in function fields

Let Fq be a finite field with q elements and p ∈ Fq [X, Y ]. In this paper we study properties of additive functions with respect to number systems which are defined in the ring Fq [X, Y ]/p(X, Y )Fq [X, Y ]. Our results comprise distribution results, exponential sum estimations as well as a version of Waring’s Problem restricted by such additive functions. Similar results have been shown for q...

متن کامل

Finite Fields, Root Systems and Orbit Numbers of Chevalley Groups

We describe combinatorial techniques to determine the numbers of semisim-ple conjugacy classes and adjoint orbits with xed class of centralizers for simply connected nite groups of Lie type.

متن کامل

Classical wavelet systems over finite fields

This article presents an analytic approach to study admissibility conditions related to classical full wavelet systems over finite fields using tools from computational harmonic analysis and theoretical linear algebra. It is shown that for a large class of non-zero window signals (wavelets), the generated classical full wavelet systems constitute a frame whose canonical dual are classical full ...

متن کامل

Recognizing Units in Number Fields

We present a deterministic polynomial-time algorithm that decides whether a power product n¿=i ff is a umt m tne ring of integers of K , where K isa number field, y, are nonzero elements of K and n¡ are rational integers. The main algorithm is based on the factor refinement method for ideals, which might be of independent interest.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indiana University Mathematics Journal

سال: 2021

ISSN: 0022-2518

DOI: 10.1512/iumj.2021.70.8257